Further Remarks on Trace Languages in P Systems with Symport/Antiport

نویسندگان

  • Guangwu Liu
  • Mihai Ionescu
  • M. Ionescu
چکیده

P systems are parallel molecular computing models which process multisets of objects in cell-like membrane structures. In this paper we consider the trace languages of a special symbol, the traveler, in symport/antiport P systems where, instead of multisets of objects, sets of objects were considered. Two different ways to define the trace language are proposed. One of the families of languages obtained in this way is proved to be equal to the family of regular languages and the other one to be strictly smaller. Some ideas for further research are also considered.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Languages by P Systems with Minimal Symport/Antiport

It is known that P systems with two membranes and minimal symport/antiport rules are “almost” computationally complete as generators of number or vector sets. Interpreting the result of the computation as the sequence of terminal symbols sent to the environment, we show that P systems with two membranes and symport rules of weight two or symport/antiport rules of weight one generate all recursi...

متن کامل

Characterizations of Context-Sensitive Languages

We give “syntactic” characterizations of context-sensitive languages (CSLs) in terms of some restricted models of symport/antiport P systems. These are the first such characterizations of CSLs in terms of P systems. In particular, we show the following for any language L over a binary alphabet: 1. Let m be any integer ≥ 1. Then L is a CSL if and only if it can be accepted by a restricted sympor...

متن کامل

Towards a Characterization of P Systems with Minimal Symport/Antiport and Two Membranes

We prove that any set of numbers containing zero generated by symport/antiport P systems with two membranes and minimal cooperation is finite (for both symport/antiport P systems and for purely symport P systems). On the other hand, one additional object in the output membrane allows symport/antiport P systems with two membranes and minimal cooperation generate any recursively enumerable sets o...

متن کامل

P Systems with Symport/Antiport of Rules

Moving “instructions” instead of “data” using transport mechanisms inspired by biology is the basic idea of the computing device presented in this paper. Specifically, we propose a new class of P systems that use both evolution rules and symport/antiport rules. The idea of this kind of systems is the following: during a computation, symbol-objects (the “data”) evolve using evolution rules, but ...

متن کامل

About P systems with symport/antiport

It is proved that four membranes suffice to P systems with minimal symport/antiport to generate all recursively enumerable sets of numbers. It is also proved that P systems with symport/antiport without maximal parallelism are equivalent to partially blind counter automata.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006